全文获取类型
收费全文 | 174篇 |
免费 | 6篇 |
国内免费 | 19篇 |
专业分类
综合类 | 3篇 |
数学 | 185篇 |
物理学 | 11篇 |
出版年
2023年 | 2篇 |
2022年 | 4篇 |
2021年 | 2篇 |
2020年 | 5篇 |
2019年 | 3篇 |
2018年 | 5篇 |
2017年 | 4篇 |
2016年 | 4篇 |
2015年 | 2篇 |
2014年 | 4篇 |
2013年 | 11篇 |
2012年 | 1篇 |
2011年 | 5篇 |
2010年 | 6篇 |
2009年 | 11篇 |
2008年 | 17篇 |
2007年 | 10篇 |
2006年 | 11篇 |
2005年 | 5篇 |
2004年 | 7篇 |
2003年 | 13篇 |
2002年 | 10篇 |
2001年 | 5篇 |
2000年 | 9篇 |
1999年 | 12篇 |
1998年 | 11篇 |
1997年 | 7篇 |
1996年 | 5篇 |
1995年 | 4篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1985年 | 1篇 |
排序方式: 共有199条查询结果,搜索用时 78 毫秒
1.
Bhalchandra D. Thatte 《Journal of Graph Theory》2020,93(2):181-202
Previously we showed that many invariants of a graph can be computed from its abstract induced subgraph poset, which is the isomorphism class of the induced subgraph poset, suitably weighted by subgraph counting numbers. In this paper, we study the abstract bond lattice of a graph, which is the isomorphism class of the lattice of distinct unlabelled connected partitions of a graph, suitably weighted by subgraph counting numbers. We show that these two abstract posets can be constructed from each other except in a few trivial cases. The constructions rely on certain generalisations of a lemma of Kocay in graph reconstruction theory to abstract induced subgraph posets. As a corollary, trees are reconstructible from their abstract bond lattice. We show that the chromatic symmetric function and the symmetric Tutte polynomial of a graph can be computed from its abstract induced subgraph poset. Stanley has asked if every tree is determined up to isomorphism by its chromatic symmetric function. We prove a counting lemma, and indicate future directions for a study of Stanley's question. 相似文献
2.
3.
We show that posets of bounded height whose cover graphs exclude a fixed graph as a topological minor have bounded dimension. This result was already proven by Walczak. However, our argument is entirely combinatorial and does not rely on structural decomposition theorems. Given a poset with large dimension but bounded height, we directly find a large clique subdivision in its cover graph. Therefore, our proof is accessible to readers not familiar with topological graph theory, and it allows us to provide explicit upper bounds on the dimension. With the introduced tools we show a second result that is supporting a conjectured generalization of the previous result. We prove that ‐free posets whose cover graphs exclude a fixed graph as a topological minor contain only standard examples of size bounded in terms of k. 相似文献
5.
6.
7.
Alexander Burstein 《Journal of Combinatorial Theory, Series A》2011,118(8):2346-2364
We give a recursive formula for the Möbius function of an interval [σ,π] in the poset of permutations ordered by pattern containment in the case where π is a decomposable permutation, that is, consists of two blocks where the first one contains all the letters 1,2,…,k for some k. This leads to many special cases of more explicit formulas. It also gives rise to a computationally efficient formula for the Möbius function in the case where σ and π are separable permutations. A permutation is separable if it can be generated from the permutation 1 by successive sums and skew sums or, equivalently, if it avoids the patterns 2413 and 3142.We also show that the Möbius function in the poset of separable permutations admits a combinatorial interpretation in terms of normal embeddings among permutations. A consequence of this interpretation is that the Möbius function of an interval [σ,π] of separable permutations is bounded by the number of occurrences of σ as a pattern in π. Another consequence is that for any separable permutation π the Möbius function of (1,π) is either 0, 1 or −1. 相似文献
8.
9.
10.
Let X1,X2,...,Xk be k disjoint subsets of S with the same cardinality m.Define H(m,k) = {X (C) S: X (C) Xi for 1 ≤I ≤k} and P(m,k) = {X (C) S : X ∩ Xi ≠φ for at least two Xi's}.Suppose S = Uki=1 Xi,and let Q(m,k,2) be the collection of all subsets K of S satisfying|K ∩ Xi|≥ 2 for some 1 ≤ I ≤ k.For any two disjoint subsets Y1 and Y2 of S,we define F1,j = {X (C) S : either |X ∩ Y1|≥ 1 or |X ∩ Y2|≥ j}.It is obvious that the four posers are graded posets ordered by inclusion.In this paper we will prove that the four posets are nested chain orders. 相似文献